Odd Multiway Cut in Directed Acyclic Graphs
نویسندگان
چکیده
We investigate the odd multiway node (edge) cut problem where the input is a graph with a specified collection of terminal nodes and the goal is to find a smallest subset of non-terminal nodes (edges) to delete so that the terminal nodes do not have an odd length path between them. In an earlier work, Lokshtanov and Ramanujan showed that both odd multiway node cut and odd multiway edge cut are fixed-parameter tractable (FPT) when parameterized by the size of the solution in undirected graphs. In this work, we focus on directed acyclic graphs (DAGs) and design a fixed-parameter algorithm. Our main contribution is an extension of the shadow-removal framework for parity problems in DAGs. We complement our FPT results with tight approximability as well as polyhedral results for 2 terminals in DAGs. Additionally, we show inapproximability results for odd multiway edge cut in undirected graphs even for 2 terminals. ∗University of Illinois, Urbana-Champaign {karthe,sahandm2}@illinois.edu
منابع مشابه
Parameterized Tractability of Multiway Cut with Parity Constraints
In this paper, we study a parity based generalization of the classical MULTIWAY CUT problem. Formally, we study the PARITY MULTIWAY CUT problem, where the input is a graph G, vertex subsets Te and To (T = Te ∪ To) called terminals, a positive integer k and the objective is to test whether there exists a k-sized vertex subset S such that S intersects all odd paths from v ∈ To to T \ {v} and all ...
متن کاملFixed-parameter tractability of directed multiway cut parameterized by the size of the cutset
Given a directed graph G, a set of k terminals and an integer p, the Directed Vertex Multiway Cut problem asks if there is a set S of at most p (nonterminal) vertices whose removal disconnects each terminal from all other terminals. Directed Edge Multiway Cut is the analogous problem where S is a set of at most p edges. These two problems indeed are known to be equivalent. A natural generalizat...
متن کاملFaster Exact Algorithms for Some Terminal Set Problems
Many problems on graphs can be expressed in the following language: given a graph G = (V,E) and a terminal set T ⊆ V , find a minimum size set S ⊆ V which intersects all “structures” (such as cycles or paths) passing through the vertices in T . We call this class of problems as terminal set problems. In this paper we introduce a general method to obtain faster exact exponential time algorithms ...
متن کاملSimple and Fast Rounding Algorithms for Directed and Node-weighted Multiway Cut
We study the multiway cut problem in directed graphs and one of its special cases, the node-weighted multiway cut problem in undirected graphs. In DIRECTED MULTIWAY CUT (DIR-MC) the input is an edge-weighted directed graph G = (V,E) and a set of k terminal nodes {s1, s2, . . . , sk} ⊆ V ; the goal is to find a min-weight subset of edges whose removal ensures that there is no path from si to sj ...
متن کاملApproximation Algorithms for Directed Multi-Multiway Cut and Directed Multicut Problems
In this paper, we present approximation algorithms for the directed multi-multiway cut and directed multicut problems. The so called region growing paradigm [1] is modified and used for these two cut problems on directed graphs By this paradigm, we give for each problem an approximation algorithm such that both algorithms have an approximate factor. The work previously done on these problems ne...
متن کامل